Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPAW/3M9PQJL
Repositorysid.inpe.br/sibgrapi/2016/08.17.11.54
Last Update2016:08.17.11.54.44 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2016/08.17.11.54.44
Metadata Last Update2022:05.18.22.21.08 (UTC) administrator
Citation KeySouzaTavaRittLotu:2016:OvMaPr
TitleAn overview of max-tree principles, algorithms and applications
FormatOn-line
Year2016
Access Date2024, May 03
Number of Files1
Size3164 KiB
2. Context
Author1 Souza, Roberto
2 Tavares, Luís
3 Rittner, Letícia
4 Lotufo, Roberto
Affiliation1 Universidade Estadual de Campinas
2 Instituto Federal de Educação, Ciência e Tecnologia do Sul de Minas
3 Universidade Estadual de Campinas
4 Universidade Estadual de Campinas
EditorAliaga, Daniel G.
Davis, Larry S.
Farias, Ricardo C.
Fernandes, Leandro A. F.
Gibson, Stuart J.
Giraldi, Gilson A.
Gois, João Paulo
Maciel, Anderson
Menotti, David
Miranda, Paulo A. V.
Musse, Soraia
Namikawa, Laercio
Pamplona, Mauricio
Papa, João Paulo
Santos, Jefersson dos
Schwartz, William Robson
Thomaz, Carlos E.
e-Mail Addressroberto.medeiros.souza@gmail.com
Conference NameConference on Graphics, Patterns and Images, 29 (SIBGRAPI)
Conference LocationSão José dos Campos, SP, Brazil
Date4-7 Oct. 2016
PublisherSociedade Brasileira de Computação
Publisher CityPorto Alegre
Book TitleProceedings
Tertiary TypeTutorial
History (UTC)2016-08-17 11:54:44 :: roberto.medeiros.souza@gmail.com -> administrator ::
2022-05-18 22:21:08 :: administrator -> :: 2016
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Keywordsmax-tree
component tree
filtering
algorithms
AbstractThe max-tree is a mathematical morphology data structure that represents an image through the hierarchical relationship of connected components resulting from different thresholds. It was proposed in 1998 by Salembier et al., since then, many efficient algorithms to build and process it were proposed. There are also efficient algorithms to extract size, shape and contrast attributes of the max-tree nodes. These algorithms allowed efficient implementation of connected filters like attribute-openings and development of automatic and semi-automatic applications that compete with the state-of-the-art. This paper reviews the max-tree principles, algorithms, applications and its current trends.
Arrangementurlib.net > SDLA > Fonds > SIBGRAPI 2016 > An overview of...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 17/08/2016 08:54 1.2 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPAW/3M9PQJL
zipped data URLhttp://urlib.net/zip/8JMKD3MGPAW/3M9PQJL
Languageen
Target Fileoverview-max-tree.pdf
User Grouproberto.medeiros.souza@gmail.com
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPAW/3M2D4LP
Citing Item Listsid.inpe.br/sibgrapi/2016/07.02.23.50 6
sid.inpe.br/banon/2001/03.30.15.38.24 2
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination doi edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume


Close